Continuous reducibility: functions versus relations
نویسندگان
چکیده
منابع مشابه
Finitary Reducibility on Equivalence Relations
We introduce the notion of finitary computable reducibility on equivalence relations on the domain ω. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular, whereas no equivalence relation can be Π n+2-complete under computable reducibility, we show that, for every n, there does exist a natural equivalence relation which...
متن کاملOn ~-reducibility versus Polynomial Time Many-one Reducibility*
We prove that each element of a class of f,anctions (denoted by NPCtP), whose graphs can be accepted in nondeterministic polynomial time, can be evaluated in deterministic polynomial time if and only if '/-reducibility is equivalent to polynomial time many-one reducibility. We also modify the proof technique used to obtain part of this result to obtain the stronger result that if every ,/-reduc...
متن کاملMeasure Reducibility of Countable Borel Equivalence Relations
We show that every basis for the countable Borel equivalence relations strictly above E0 under measure reducibility is uncountable, thereby ruling out natural generalizations of the Glimm-Effros dichotomy. We also push many known results concerning the abstract structure of the measure reducibility hierarchy to its base, using arguments substantially simpler than those previously employed.
متن کاملBorel-piecewise continuous reducibility for uniformization problems
We study a fine hierarchy of Borel-piecewise continuous functions, especially, between closed-piecewise continuity and Gδ-piecewise continuity. Our aim is to understand how a priority argument in computability theory is connected to the notion of Gδ-piecewise continuity, and then we utilize this connection to obtain separation results on subclasses of Gδ-piecewise continuous reductions for unif...
متن کاملMartin-löf Reducibility and Cost Functions
Martin-Löf (ML)-reducibility compares K-trivial sets by examining the Martin-Löf random sequences that compute them. We show that every K-trivial set is computable from a c.e. set of the same ML-degree. We investigate the interplay between ML-reducibility and cost functions, which are used to both measure the number of changes in a computable approximation, and the type of null sets used to cap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Reports on Mathematical Logic
سال: 2019
ISSN: 2084-2589,0137-2904
DOI: 10.4467/20842589rm.19.002.10650